Title: Enhanced Encoding and Verification Methods for the Ntru Signature Scheme Section 1. the Hard Problem Underlying Ntru and Nss
نویسندگان
چکیده
The NTRU Signature Scheme (NSS) is a digital signature scheme based on a hard lattice problem. This lattice problem also underlies the NTRU Public Key Cryptosystem described in [1]. In this section we remind the reader of the standard description of the NTRU lattice problem in terms of products of polynomials in convolution rings. For further details, see [1]. Fix three positive integer parameters N , p, and q with gcd(p, q) = 1. Let R be the ring R = Z[X]/(XN − 1).
منابع مشابه
NSS: The NTRU Signature Scheme
A new authentication and digital signature scheme called the NTRU Signature Scheme (NSS) is introduced. NSS provides an authentication/signature method complementary to the NTRU public key cryptosystem. The hard lattice problem underlying NSS is similar to the hard problem underlying NTRU, and NSS similarly features high speed, low footprint, and easy key creation.
متن کاملNSS: An NTRU Lattice-Based Signature Scheme
A new authentication and digital signature scheme called the NTRU Signature Scheme (NSS) is introduced. NSS provides an authentication/signature method complementary to the NTRU public key cryptosystem. The hard lattice problem underlying NSS is similar to the hard problem underlying NTRU, and NSS similarly features high speed, low footprint, and easy key creation.
متن کاملCryptanalysis of the NTRU Signature Scheme (NSS) from Eurocrypt 2001
In 1996, a new cryptosystem called NTRU was introduced, related to the hardness of finding short vectors in specific lattices. At Eurocrypt 2001, the NTRU Signature Scheme (NSS), a signature scheme apparently related to the same hard problem, was proposed. In this paper, we show that the problem on which NSS relies is much easier than anticipated, and we describe an attack that allows efficient...
متن کاملThe NTRU Signature Scheme: Theory and Practice
The NTRU Signature Scheme (NSS) with enhanced document encoding and signature verification is described. Three areas of security are investigated: (1) It is proven (under a heuristic assumption) that direct forgery is equivalent to the solution of a closest vector problem, up to constant factor, in an NTRU convolution modular lattice. (2) The probability of forgery using partially preselected v...
متن کاملNSS: A Lattice-Based Signature Scheme
The purpose of this paper is to submit the NSS lattice based signature scheme for consideration for inclusion in the IEEE P1363.1 standard. At the rump session of CRYPTO ’96 the authors introduced a highly efficient new public key cryptosystem called NTRU. (See [4] for details.) Underlying NTRU is a hard mathematical problem of finding short vectors in certain lattices. In this paper we introdu...
متن کامل